On the Dominant Local Resolving Set of Vertex Amalgamation Graphs
نویسندگان
چکیده
Basically, the new topic of dominant local metric dimension which be symbolized by Ddim_l (H) is a combination two concepts in graph theory, they were called and dominating set. There are some terms this that resolving set basis. An ordered subset W_l said G if also G. While basis with minimum cardinality. This study uses literature method observing number before detecting graphs. After obtaining results, purpose research how vertex amalgamation product Some special graphs used star, friendship, complete bipartite graph. Based on all observation it can for any depends copied terminal constructed
منابع مشابه
On vertex balance index set of some graphs
Let Z2 = {0, 1} and G = (V ,E) be a graph. A labeling f : V → Z2 induces an edge labeling f* : E →Z2 defined by f*(uv) = f(u).f (v). For i ε Z2 let vf (i) = v(i) = card{v ε V : f(v) = i} and ef (i) = e(i) = {e ε E : f*(e) = i}. A labeling f is said to be Vertex-friendly if | v(0) − v(1) |≤ 1. The vertex balance index set is defined by {| ef (0) − ef (1) | : f is vertex-friendly}. In this paper ...
متن کاملLabeling the vertex amalgamation of graphs
A graph G of size q is graceful if there exists an injective function f : V (G) → {0, 1, . . . , q} such that each edge uv of G is labeled |f(u)− f(v)| and the resulting edge labels are distinct. Also, a (p, q) graph G with q ≥ p is harmonious if there exists an injective function f : V (G) → Zq such that each edge uv of G is labeled f(u)+f(v) (mod q) and the resulting edge labels are distinct,...
متن کاملon vertex balance index set of some graphs
let z2 = {0, 1} and g = (v ,e) be a graph. a labeling f : v → z2 induces an edge labeling f* : e →z2 defined by f*(uv) = f(u).f (v). for i ε z2 let vf (i) = v(i) = card{v ε v : f(v) = i} and ef (i) = e(i) = {e ε e : f*(e) = i}. a labeling f is said to be vertex-friendly if | v(0) − v(1) |≤ 1. the vertex balance index set is defined by {| ef (0) − ef (1) | : f is vertex-friendly}. in this paper ...
متن کاملFeedback vertex set on AT-free graphs
We present a polynomial time algorithm to compute a minimum (weight) feedback vertex set for AT-free graphs, and extending this approach we obtain a polynomial time algorithm for graphs of bounded asteroidal number.
متن کاملSolving the feedback vertex set problem on undirected graphs
Feedback problems consist of removing a minimal number of vertices of a directed or undirected graph in order to make it acyclic. The problem is known to be NPcomplete. In this paper we consider the variant on undirected graphs. The polyhedral structure of the Feedback Vertex Set polytope is studied. We prove that this polytope is full dimensional and show that some inequalities are facet de ni...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Cauchy
سال: 2023
ISSN: ['2477-3344', '2086-0382']
DOI: https://doi.org/10.18860/ca.v7i4.18891